-
1 последовательная полнота
Русско-английский научно-технический словарь Масловского > последовательная полнота
-
2 последовательная полнота
Mathematics: sequential completenessУниверсальный русско-английский словарь > последовательная полнота
-
3 рациональность
от лат. rationalis разумныйГипотеза о рациональности реализована на двух основных предположениях об отношении предпочтения: полнота и транзитивность. — The hypothesis of rationality is embodied in two basic assumptions about the preference relation: completeness and transitivity.
рациональность, общественная, недостаточно полная — less than full social rationality
рациональность, последовательная — sequential rationality
рациональность стратегий, последовательная — sequential rationality of strategies
Russian-English Dictionary "Microeconomics" > рациональность
-
4 принцип неразборчивости
"anything goes" principleпринцип полноты (или универсальности) рынков — principle of completeness (or universality) of markets
принцип понятности (открытый Лангером с соавторами) — principle of intelligibility (discovered by Langer et al.)
принцип 'предположений и опровержений', эпистемологический — epistemological principle of 'conjectures and refutations'
принцип расчета вознаграждения за управление и за результат — basis for calculation of management and performance fees
принципы регулирования, теоретические — theoretical foundations of regulation
Теоретические принципы регулирования требуют некоторого знакомства с теорией стимулов, а это потребовало бы дополнительных разработок. — Theoretical foundations of regulation require some familiarity with the theory of incentives, which would require further development.
принципы репутации, рациональные — rational foundations of goodwill
Russian-English Dictionary "Microeconomics" > принцип неразборчивости
См. также в других словарях:
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
Denotational semantics of the Actor model — The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b]. Contents 1 Actor fixed point semantics 2 Compositionality in… … Wikipedia
Natural deduction — In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the natural way of reasoning. This contrasts with the axiomatic systems which instead use… … Wikipedia
P-complete — In complexity theory, the notion of P complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Commodore DOS — Commodore DOS, aka CBM DOS, was the disk operating system used with Commodore s 8 bit computers. Unlike most other DOS systems before or since which are booted from disk into the main computer s own RAM at startup, and executed there CBM DOS was… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
